Relating Disjunctive Logic Programs to Default Theories
نویسندگان
چکیده
This paper presents the relationship between disjunctive logic programs and default theories. We rst show that Bidoit and Froidevaux's positivist default theory causes a problem in the presence of disjunctive information in a program. Then we present a correct transformation of disjunctive logic programs into default theories and show a one-to-one correspondence between the stable models of a program and the extensions of its associated default theory. We also extend the results to extended disjunctive programs and investigate their connections with Gelfond et al's disjunctive default theory, autoepistemic logic, and circumscription.
منابع مشابه
On Extended Disjunctive Logic Programs
This paper studies, in a comprehensive manner, diierent aspects of extended disjunctive logic programs, that is, programs whose clauses are of the form l 1 not is the negation-by-default operator. The explicit use of classical negation suggests the introduction of a new truth value, namely, logical falsehood (in contrast to falsehood-by-default) in the semantics. General techniques are describe...
متن کاملExtended Logic Programs as Autoepistemic Theories
Recent research on applications of nonmonotonic reasoning to the semantics of logic programs demonstrates that some nonmonotonic formalisms are better suited for such use than others. Circumscription is applicable as long as the programs under consideration are stratiied. To describe the semantics of general logic programs without the stratiication assumption, one has to use autoepistemic logic...
متن کاملComplexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
Ben-Eliyahu and Dechter have shown that stable semantics of a large class of extended propositional disjunctive logic programs (EDLPs) can be eeciently expressed in the language of propositional logic. They left it as an open issue whether this possible for all such programs. We provide strong evidence that this is not so, which is a consequence of a precise complexity characterization of query...
متن کاملGenerated Models and Extensions of Nonmonotonic Systems
Stable generated models provide a general semantics for logic programming. Although equal for normal programs, they diier from the answer set semantics on disjunctive programs. We show that stable generated semantics coincide with the semantics obtained by translating programs into a minimal partial temporal logic into which a subsystem of default logic can be embedded. This leads us to a new v...
متن کاملDomain-theoretic Semantics for Disjunctive Logic Programs
We propose three equivalent domain-theoretic semantics for dis-junctive logic programs in the style of Gelfond and Lifschitz. These are (i) a resolution-style inference semantics; (ii) a model-theoretic semantics; and (iii) a (nondeterministic) state-transition semantics. We show how these three semantics generalize \for free" to disjunctive logic programming over any Scott domain. We also rela...
متن کامل